A new efficient TKHC-based image sharing scheme over unsecured channel
نویسندگان
چکیده
منابع مشابه
An efficient secure channel coding scheme based on polar codes
In this paper, we propose a new framework for joint encryption encoding scheme based on polar codes, namely efficient and secure joint secret key encryption channel coding scheme. The issue of using new coding structure, i.e. polar codes in Rao-Nam (RN) like schemes is addressed. Cryptanalysis methods show that the proposed scheme has an acceptable level of security with a relatively smaller ke...
متن کاملA NEW SECRET SHARING SCHEME ADVERSARY FUZZY STRUCTURE BASED ON AUTOMATA
In this paper,we introduce a new verifiable multi-use multi-secretsharing scheme based on automata and one-way hash function. The scheme has theadversary fuzzy structure and satisfy the following properties:1) The dealer can change the participants and the adversary fuzzy structure without refreshing any participants' real-shadow. 2) The scheme is based on the inversion of weakly invertible fin...
متن کاملSecurity Analysis of a Hash-Based Secret Sharing Scheme
Secret sharing schemes perform an important role in protecting se-cret by sharing it among multiple participants. In 1979, (t; n) threshold secret sharing schemes were proposed by Shamir and Blakley independently. In a (t; n) threshold secret sharing scheme a secret can be shared among n partic-ipants such that t or more participants can reconstruct the secret, but it can not be reconstructed b...
متن کاملA Multilevel Image Encryption based on Duffing map and Modified DNA Hybridization for Transfer over an Unsecured Channel
It was known to us from decades it is been a factual challenge for us to transfer the privileged data specially images to transfer over a unsecured channel. In this paper we propose a novel image encryption technique using DNA interwearing based Hybridization along with chaotic maps to transfer image data over a unsecured channel. In the early stages we apply Duffing map(chaotic map) on the ori...
متن کاملA New (k, n) Secret Image Sharing Scheme (SISS)
In this paper, a new (k, n) threshold Secret Image Sharing Scheme (SISS) is proposed. In the proposed scheme the secret image is first partitioned into several non-overlapping blocks of k pixels. Every k pixel is assumed as the vertices of a complete graph G. Each spanning tree of G is represented by k pixels along with Prüfer sequence and used to form k pixels of a share image. The original se...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of King Saud University - Computer and Information Sciences
سال: 2019
ISSN: 1319-1578
DOI: 10.1016/j.jksuci.2019.08.004